A New Smoothing Conjugate Gradient Method for Solving Nonlinear Nonsmooth Complementarity Problems
نویسندگان
چکیده
In this paper, by using the smoothing Fischer-Burmeister function, we present a new smoothing conjugate gradient method for solving the nonlinear nonsmooth complementarity problems. The line search which we used guarantees the descent of the method. Under suitable conditions, the new smoothing conjugate gradient method is proved globally convergent. Finally, preliminary numerical experiments show that the new method is efficient.
منابع مشابه
Smoothing Nonlinear Conjugate Gradient Method for Image Restoration Using Nonsmooth Nonconvex Minimization
Image restoration problems are often converted into large-scale, nonsmooth and nonconvex optimization problems. Most existing minimization methods are not efficient for solving such problems. It is well-known that nonlinear conjugate gradient methods are preferred to solve large-scale smooth optimization problems due to their simplicity, low storage, practical computation efficiency and nice co...
متن کاملA Three-terms Conjugate Gradient Algorithm for Solving Large-Scale Systems of Nonlinear Equations
Nonlinear conjugate gradient method is well known in solving large-scale unconstrained optimization problems due to it’s low storage requirement and simple to implement. Research activities on it’s application to handle higher dimensional systems of nonlinear equations are just beginning. This paper presents a Threeterm Conjugate Gradient algorithm for solving Large-Scale systems of nonlinear e...
متن کاملA New Smoothing Nonlinear Conjugate Gradient Method for Nonsmooth Equations with Finitely Many Maximum Functions
and Applied Analysis 3 By Lemmas 4 and 5, we have Lemma 6. Lemma 6. Suppose that Assumption 3 holds, αk is determined by (9), and we get
متن کاملSmoothing Functions and A Smoothing Newton Method for Complementarity and Variational Inequality Problems
In this paper, we discuss smoothing approximations of nonsmooth functions arising from complementarity and variational inequality problems. We present some new results which are essential in designing Newton-type methods. We introduce several new classes of smoothing functions for nonlinear complementarity problems and order complementarity problems. In particular, in the first time some comput...
متن کاملJacobian Smoothing Methods for General Nonlinear Complementarity Problems
We present a new algorithm for the solution of general (not necessarily monotone) complementarity problems. The algorithm is based on a reformulation of the complementar-ity problem as a nonsmooth system of equations by using the Fischer-Burmeister function. We use an idea by Chen, Qi and Sun and apply a Jacobian smoothing method (which is a mixture between nonsmooth Newton and smoothing method...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Algorithms
دوره 8 شماره
صفحات -
تاریخ انتشار 2015